Tropical Grasslands-Forrajes Tropicales Vol.1 No.1 [September 2013]

Journal of Information and Computing Science, JIC, Vol1 2006 No1

( , ) k s SAT − is the propositional satisfiable problem restricted to instances where each clause has exactly k distinct literals and every variable occurs at most s times. It is known that there exits an exponential function f such that for ( ) s f k ≤ , all ( , ) k s SAT − instances are satisfiable, but ( , ( ) 1) k f k SAT + − is already NPcomplete ( 3 k ≥ ). Therefore, we call the function...

Journal of Information and Computing Science, JIC, Vol1 2006 No1, ISSN 1746-7659

Abstract. Time Petri Nets (TPNs) are a popular Petri net model for specification and verification of real-time systems. A widely applied method for analyzing Petri nets is component-level reduction analysis. The existing technique for component-level reduction analysis transforms a TPN component to a constant size of simple one while maintains the net external observable timing properties, but ...

Package ‘ surveillance ’ September 9 , 2013

In the September 2013 issue

Package ‘ Zelig ’ September 21 , 2013

Description Zelig is an easy-to-use program that can estimate, and help interpret the results of, an enormous range of statistical models. It literally is ‘‘everyone’s statistical software’’ because Zelig’s simple unified framework incorporates everyone else’s (R) code. We also hope it will become ‘‘everyone’s statistical software’’ for applications and teaching, and so have designed Zelig so t...